On Orthogonal Signalling in Gaussian MAC With Peak Constraints
نویسندگان
چکیده
This paper is a follow up to [1] on the two-user Gaussian Multiple Access Channel (MAC) with peak constraints at the transmitters. It is shown that there exist an infinite number of sum-rate-optimal points on the boundary of the capacity region. In contrast to the Gaussian MAC with power constraints, we verify that Time Division (TD) can not achieve any of the sumrate-optimal points in the Gaussian MAC with peak constraints. Using the so-called I-MMSE identity of Guo et.al, the largest achievable sum-rate by Orthogonal Code Division (OCD) is characterized where it is shown that Walsh-Hadamard spreading codes of length 2 are optimal. In the symmetric case where the peak constraints at both transmitters are similar, we verify that OCD can achieve a sum-rate that is strictly larger than the highest sum-rate achieved by TD. Finally, it is demonstrated that there are values for the maximum peak at the transmitters such that OCD can not achieve any of the sum-rate-optimal points on the boundary of the capacity region.
منابع مشابه
Sum Capacity (sub)optimality of Orthogonal Transmissions in Vector Gaussian Multiple Access Channels
We study in this paper the sum capacity achievability of orthogonal transmissions in vector Gaussian multiple access channels (MAC). Speci cally, we derive the suf cient and necessary conditions, in terms of channel matrices and transmitter power constraints, for orthogonal transmission to achieve the sum capacity of a vector Gaussian MAC. The obtained conditions provide a uni ed framework in e...
متن کاملOn the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملCapacity-Achieving Distributions of Gaussian Multiple Access Channel with Peak Constraints
Characterizing probability distribution function for the input of a communication channel that achieves the maximum possible data rate, is one of the most fundamental problems in the field of information theory. In his ground-breaking paper, Shannon showed that the capacity of a point-to-point additive white Gaussian noise channel under an average power constraint at the input, is achieved by G...
متن کاملExtension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملA Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...
متن کامل